Using Delaunay Triangulation for Fingerprint Template Generation
نویسندگان
چکیده
منابع مشابه
Constrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملFingerprint Orientation Field Interpolation Based on the Constrained Delaunay Triangulation
A direction map or an orientation field is widely used in automatic fingerprint verification and recognition systems. In most existing methods, the block-wise orientation field is computed from the squared gradients. Since a fingerprint image can contain areas that may be smeared or scarcely distributed, faulty orientations can be produced during the process of orientation field estimation. In ...
متن کاملRobot Motion Using Delaunay Triangulation
Robot motion is nowadays studied from a lot of different perspectives. This paper is based on the assumption of a fully known environment, allowing the supervisor to plan the robot trajectory before the actual motion. The auxiliary structure we mainly use is the Delaunay triangulation. We analyze the implementation details, as well as the limits of the geometrical model we use.
متن کاملConforming Centroidal Voronoi Delaunay Triangulation for Quality Mesh Generation
As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...
متن کاملRevisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consiste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the South Ural State University. Ser. Computer Technologies, Automatic Control & Radioelectronics
سال: 2019
ISSN: 1991-976X,2409-6571
DOI: 10.14529/ctcr190303